Task Allocation on Layered Multiagent Systems: When Evolutionary Many-Objective Optimization Meets Deep Q-Learning

نویسندگان

چکیده

This article is concerned with the multitask multiagent allocation problem via many-objective optimization for systems (MASs). First, a novel layered MAS model constructed to address that includes both original task simplification and allocation. In first layer of model, deep Q-learning method introduced simplify prioritization set. second modified shift-based density estimation (MSDE) put forward improve conventional strength Pareto evolutionary algorithm 2 (SPEA2) in order achieve on assignments. Then, an MSDE-SPEA2-based proposed tackle objectives including allocation, makespan, agent satisfaction, resource utilization, completion, waiting time. As compared existing methods, developed this exhibits outstanding feature assignment scheduling are carried out simultaneously. Finally, extensive experiments conducted to: 1) verify validity effectiveness two main algorithms 2) illustrate optimal solution efficient strategy under different scenarios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Layered Learning in Multiagent Systems

Multi-agent systems in complex, real-time domains require agents to act e ectively both autonomously and as part of a team. This dissertation addresses multi-agent systems consisting of teams of autonomous agents acting in real-time, noisy, collaborative, and adversarial environments. Because of the inherent complexity of this type of multi-agent system, this thesis investigates the use of mach...

متن کامل

Adaptive -Ranking and Distribution Search on Evolutionary Many-objective Optimization

In this work, we study the effectiveness of Adaptive -Ranking for distribution search in the context of many-objective optimization. Adaptive -Ranking re-classifies sets of non-dominated solutions using iteratively a randomized sampling procedure that applies -dominance with a mapping function f(x) 7→ f (x) to bias selection towards the distribution of solutions implicit in the mapping. We anal...

متن کامل

Evolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm

In this paper, we propose a new multi-objective evolutionary algorithm (MOEA), which transforms a multi-objective optimization problem into a linear assignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our sea...

متن کامل

A Comparative Study on Evolutionary Algorithms for Many-Objective Optimization

Many-objective optimization has been gaining increasing attention in the evolutionary multiobjective optimization community, and various approaches have been developed to solve many-objective problems in recent years. However, the existing empirically comparative studies are often restricted to only a few approaches on a handful of test problems. This paper provides a systematic comparison of e...

متن کامل

Evolutionary Many-Objective Optimization Based on Adversarial Decomposition

The decomposition-based method has been recognized as a major approach for multiobjective optimization. It decomposes a multi-objective optimization problem into several singleobjective optimization subproblems, each of which is usually defined as a scalarizing function using a weight vector. Due to the characteristics of the contour line of a particular scalarizing function, the performance of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2021

ISSN: ['1941-0026', '1089-778X']

DOI: https://doi.org/10.1109/tevc.2021.3049131